Step Size in Stein's Method of Exchangeable Pairs
نویسندگان
چکیده
منابع مشابه
Step Size in Stein's Method of Exchangeable Pairs
Stein’s method of exchangeable pairs is examined through five examples in relation to Poisson and normal distribution approximation. In particular, in the case where the exchangeable pair is constructed from a reversible Markov chain, we analyze how modifying the step size of the chain in a natural way affects the error term in the approximation acquired through Stein’s method. It has been note...
متن کاملExponential approximation and Stein’s method of exchangeable pairs
The purpose of this paper is to further develop exponential approximation, using Stein’s method of exchangeable pairs. The first use of exchangeable pairs in exponential approximation was in the paper Chatterjee et al. (2011), which studied the spectrum of the Bernoulli-Laplace Markov chain. Unfortunately the results in Chatterjee et al. (2011), which use the Kolmogorov metric, are very complic...
متن کاملMatrix concentration inequalities via the method of exchangeable pairs
This paper derives exponential concentration inequalities and polynomial moment inequalities for the spectral norm of a random matrix. The analysis requires a matrix extension of the scalar concentration theory developed by Sourav Chatterjee using Stein’s method of exchangeable pairs. When applied to a sum of independent random matrices, this approach yields matrix generalizations of the classi...
متن کاملExponential Approximation by Exchangeable Pairs and Spectral Graph Theory Running head: Exponential Approximation by Exchangeable Pairs
Running head: Exponential Approximation by Exchangeable Pairs Version of 4/7/06 By Sourav Chatterjee and Jason Fulman Abstract: A general Berry-Esseen bound is obtained for the exponential distribution using Stein’s method of exchangeable pairs. As an application, an error term is derived for Hora’s result that the spectrum of the Bernoulli-Laplace Markov chain has an exponential limit. This is...
متن کاملExchangeable Pairs, Switchings, and Random Regular Graphs
We consider the distribution of cycle counts in a random regular graph, which is closely linked to the graph’s spectral properties. We broaden the asymptotic regime in which the cycle counts are known to be approximately Poisson, and we give an explicit bound in total variation distance for the approximation. Using this result, we calculate limiting distributions of linear eigenvalue statistics...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2009
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s096354830999023x